Analysis of algorithms - PDFSEARCH.IO - Document Search Engine

Analysis of algorithms
Results: 1454

#	Item
911	Evaluating Centrality Metrics in Real-World Networks on GPU Anuroop Sriram Kollu Gautham Kishore Kothapalli P. J. Narayan R Govindarajulu International Institute of Information Technology, Hyderabad Gachibowli, Hyderabad Add to Reading List Source URL: www.hipc.org Language: English - Date: 2009-11-13 17:38:52 Theoretical computer science Networks Network analysis Search algorithms Centrality Betweenness centrality Shortest path problem Breadth-first search Parallel computing Mathematics Graph theory Network theory
912	Robust pole assignment Pole assignment is a basic method for designing state feedback controllers. One direction in developing new pole assignment algorithms is to improve the efficiency of computations, up to the limit Add to Reading List Source URL: www.dlr.de Language: English - Date: 2007-05-21 06:04:32 Mathematics Control theory Algorithm Mathematical optimization Numerical analysis Applied mathematics Science Cybernetics
913	Model and controller reduction Model reduction Model order reduction is of fundamental importance in many modelling and control applications. The most frequently employed model reduction algorithms for linear, stable, co Add to Reading List Source URL: www.dlr.de Language: English - Date: 2007-05-21 06:04:23 Algorithm Mathematical optimization Mathematics Science Applied mathematics Computational science Numerical analysis
914	A Calculational Approach to Program Inversion Shin-Cheng Mu Linacre College 23rd January 2003 Add to Reading List Source URL: www.iis.sinica.edu.tw Language: English - Date: 1969-12-31 19:00:00 Operations research Mathematical optimization Mathematical logic Analysis of algorithms Algorithm RSA Dynamic programming Tree traversal Time complexity Mathematics Theoretical computer science Applied mathematics
915	Location, Location, Location—The Role of Spatial Locality in Asymptotic Energy Minimization Add to Reading List Source URL: ic.ese.upenn.edu Language: English - Date: 2012-12-07 21:21:13 Computational complexity theory Mathematics Asymptotically optimal algorithm Field-programmable gate array Parallel computing Time complexity Big O notation Circuit complexity Reconfigurable computing Analysis of algorithms Applied mathematics Computer science
916	Greedy Algorithms for Structurally Constrained High Dimensional Problems Pradeep Ravikumar Department of Computer Science University of Texas at Austin Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2011-10-28 19:06:35 Linear algebra Convex analysis Functional analysis Numerical linear algebra Function spaces Norm Vector space Sparse approximation Convex function Algebra Mathematics Mathematical analysis
917	Faster possibility detection by combining two approaches Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2013-09-12 23:52:14 Formal methods Computability theory Models of computation Analysis of algorithms Algorithm Lambda calculus Big O notation Vertex cover Centimetre–gram–second system of units Mathematics Theoretical computer science Applied mathematics
918	Old and new algorithms for computing Bernoulli numbers David Harvey University of New South Wales 25th September 2012, University of Ballarat Add to Reading List Source URL: web.maths.unsw.edu.au Language: English - Date: 2012-10-02 23:58:35 Integer sequences Bernoulli number Topology Complex analysis Mathematical series Factorial Alternating permutation Algorithm Pi Mathematics Mathematical analysis Number theory
919	A Comparative Evaluation of Anomaly Detection Algorithms for Maritime Video Surveillance Bryan Auslander1, Kalyan Moy Gupta1, and David W. Aha2 1 Knexus Research Corporation; Springfield, VA 22153 Add to Reading List Source URL: www.nrl.navy.mil Language: English - Date: 2013-08-26 10:24:10 Data analysis Formal sciences Anomaly detection Data security Local outlier factor Cluster analysis Anomaly K-nearest neighbor algorithm K-means clustering Statistics Data mining Machine learning
920	Approximate Analysis of a Round Robin Scheduling Scheme for Network Coding Omer H. Abdelrahman and Erol Gelenbe Department of Electrical and Electronic Engineering, Imperial College London, UK {oha06,e.gelenbe}@imperial Add to Reading List Source URL: san.ee.ic.ac.uk Language: English - Date: 2009-06-22 10:40:00 Stochastic processes Mathematical sciences Scheduling algorithms Markov models Operations research Network coding Queueing model Throughput Packet switching Statistics Network performance Probability and statistics

UPDATE